Contour integration across attributes occurs in parallel, within attribute maps

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contour integration across depth

In order to investigate the extent of the local connections subserving contour integration across depth, we measured performance for detecting the continuity of a path of Gabor elements distributed in depth and embedded in a three-dimensional field of random background elements. The results show that performance cannot be explained in terms of monocular performance and that contour information ...

متن کامل

Contour Integration across Depth 1701 ( a ) Path Stereo - Pair

Depth In order to investigate the extent of the local connections subserving contour integration across depth, we measured performance for detecting the continuity of a path of Gabor elements distributed in depth and embedded in a three-dimensional field of random background elements. The results show that performance cannot be explained in terms of monocular performance and that contour inform...

متن کامل

Parallel Edge Localization and Contour Integration - Dynamic Receptive Fields

The paper describes an edge localization and contour integration technique that is parallel and modular in terms of the communication and computation structures. The technique can also detect corners and junctions accurately. Our technique is biologically motivated, in particular the biological behavior known as dynamic receptive fields or shortterm plasticity. Extensive experiments are conduct...

متن کامل

Dynamic Attributes Design in Attribute Based Encryption

In the past, sending encrypted messages to a group of users is not easy since it requires a shared group key in advance. Ciphertext-policy attribute based encryption (CPABE) achieves true that anyone who is expected to see the message content can decrypt messages in the absence of group keys. Say, a sender encrypts messages with an access control policy tree which is composed of attributes; a r...

متن کامل

Simplifying Massive Contour Maps

We present a simple, efficient and practical algorithm for constructing and subsequently simplifying contour maps from massive high-resolution DEMs, under some practically realistic assumptions on the DEM and contours.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2010

ISSN: 1534-7362

DOI: 10.1167/2.7.475